- transform pair
- пара взаимообратных трансформант (напр., пара преобразований Фурье)
Англо-русский словарь нефтегазовой промышленности. 2011.
transform pair
Смотреть что такое "transform pair" в других словарях:
Box-Muller transform — A Box Muller transform (by George Edward Pelham Box and Mervin Edgar Muller 1958) [ [http://projecteuclid.org/DPubS/Repository/1.0/Disseminate?view=body id=pdf 1 handle=euclid.aoms/1177706645 G. E. P. Box and Mervin E. Muller, A Note on the… … Wikipedia
Fourier transform ion cyclotron resonance — Infobox chemical analysis name = Fourier transform ion cyclotron resonance caption =A FTMS instrument at the Pacific Northwest National Laboratory, USA acronym = FTMS, FTICR classification =Mass spectrometry analytes = manufacturers = related =… … Wikipedia
Inverse scattering transform — In mathematics, the inverse scattering transform is a method for solving some non linear partial differential equations. It is one of the most important developments in mathematical physics in the past 40 years. The method is a non linear… … Wikipedia
Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… … Wikipedia
Hough transform — The Hough transform (pronEng|ˈhʌf, rhymes with tough ) is a feature extraction technique used in image analysis, computer vision, and digital image processing. [Shapiro, Linda and Stockman, George. “Computer Vision,” Prentice Hall, Inc. 2001] The … Wikipedia
Hartley transform — In mathematics, the Hartley transform is an integral transform closely related to the Fourier transform, but which transforms real valued functions to real valued functions. It was proposed as an alternative to the Fourier transform by R. V. L.… … Wikipedia
Hit-or-miss transform — In mathematical morphology, hit or miss transform is an operation that detects a given configuration (or pattern) in a binary image, using the morphological erosion operator and a pair of disjoint structuring elements. The result of the hit or… … Wikipedia
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Discrete wavelet transform — An example of the 2D discrete wavelet transform that is used in JPEG2000. The original image is high pass filtered, yielding the three large images, each describing local changes in brightness (details) in the original image. It is then low pass… … Wikipedia
Modified discrete cosine transform — The modified discrete cosine transform (MDCT) is a Fourier related transform based on the type IV discrete cosine transform (DCT IV), with the additional property of being lapped: it is designed to be performed on consecutive blocks of a larger… … Wikipedia
Burrows-Wheeler transform — The Burrows Wheeler transform (BWT, also called block sorting compression), is an algorithm used in data compression techniques such as bzip2. It was invented by Michael Burrows and David Wheeler in 1994 while working at DEC Systems Research… … Wikipedia
